Prof. Dr. Dirk Langemann Institut Computational Mathematics Technische Universit¨at Braunschweig PockelsstraßeBraunschweig Braunschweig, 15. April 2012

Source URL: www.tu-braunschweig.de

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Source URL: www.iwr.uni-heidelberg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Graph
• Travelling salesman problem
• Vertex
• Cycle
• Hamiltonian path
• Graph automorphism
• Vertex cover

An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

Source URL: ceur-ws.org

• Theoretical computer science
• Automated planning and scheduling
• Logic in computer science
• Mathematics
• Computational complexity theory
• Boolean algebra
• Electronic design automation
• Formal methods
• Boolean satisfiability problem
• Maximum satisfiability problem
• Planning Domain Definition Language
• Satz

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Geometry
• Computer science
• Search algorithms
• Discrete geometry
• Computational geometry
• Mathematical optimization
• Closest pair of points problem
• Nearest neighbor search
• Nearest neighbor graph
• K-nearest neighbors algorithm
• Euclidean minimum spanning tree

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Source URL: web.stanford.edu

• Mathematics
• Search algorithms
• Information retrieval
• Information science
• Hashing
• Analysis of algorithms
• Cryptographic hash functions
• Computational complexity theory
• Universal hashing
• Hash function
• Randomized algorithm
• Subset sum problem

EFFICIENT SETTLEMENT SELECTION FOR INTERACTIVE DISPLAY Marc van Kreveld* Rene van Oostrum* Department of Computer Science Utrecht University

Source URL: mapcontext.com

• Mathematics
• Computational geometry
• Diagrams
• Discrete geometry
• Voronoi diagram
• Search algorithms
• K-nearest neighbors algorithm
• Delaunay triangulation
• Algorithm
• Computer science
• Discrete mathematics

Unsupervised Image Embedding Using Nonparametric Statistics Guobiao Mei University of California, Riverside Abstract

Source URL: rlair.cs.ucr.edu

• Mathematics
• Statistics
• Dimension reduction
• Topology
• Multivariate statistics
• Computational statistics
• Machine learning
• Dimension
• Nonlinear dimensionality reduction
• Isomap
• Semidefinite embedding
• Embedding

Microsoft Wordissue.doc

Source URL: isdlab.ie.ntnu.edu.tw

• Fuzzy logic
• Artificial intelligence
• Logic
• Academia
• Science and technology
• Fuzzy Sets and Systems
• Fuzzy set
• Genetic fuzzy systems
• Neuro-fuzzy
• Fuzzy mathematics
• Computational intelligence
• European Society for Fuzzy Logic and Technology

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Source URL: disco.ethz.ch

• Analysis of algorithms
• Computational complexity theory
• Theory of computation
• Mathematics
• Balls into bins
• With high probability
• Sorting algorithm
• Leader election
• Time complexity
• Entropy
• Best
• worst and average case
• Big O notation

Microsoft PowerPoint - ch07_9 [Compatibility Mode]

Source URL: www.math.nus.edu.sg

• Numerical software
• Mathematics
• Computational group theory
• Donald Knuth
• KnuthBendix completion algorithm
• GCD test